Key to Network Controllability

Liu et. al. recently proposed a minimum number of driver nodes, ND, needed to obtain full structural controllability over a directed network [1]. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most important assertion is that a system’s controllability is to a great extent encoded by the underlying network’s degree distribution, P (kin, kout). Is the controllability of a network decided almost completely by the immediate neighbourhood of a node, while, even slightly distant nodes play no role at all? Motivated by the above question, in this communication, we argue that an effective understanding of controllability in directed networks can be reached using distance based measures of closeness centrality (CC) and betweenness centrality (BC) and may not require the knowledge of local connectivity measures like in-degree and out-degree.